On the Complexity of Local Search for Weighted Standard Set Problems
نویسندگان
چکیده
In this paper, we study the complexity of computing locally optimal solutions for weighted versions of standard set problems such as SETCOVER, SETPACKING, and many more. For our investigation, we use the framework of PLS, as defined in Johnson et al., [13]. We show that for most of these problems, computing a locally optimal solution is already PLS-complete for a simple natural neighborhood of size one. For the local search versions of weighted SETPACKING and SETCOVER, we derive tight bounds for a simple neighborhood of size two. To the best of our knowledge, these are one of the very few PLS results about local search for weighted standard set problems.
منابع مشابه
Controller Placement in Software Defined Network using Iterated Local Search
Software defined network is a new computer network architecture who separates controller and data layer in network devices such as switches and routers. By the emerge of software defined networks, a class of location problems, called controller placement problem, has attracted much more research attention. The task in the problem is to simultaneously find optimal number and location of controll...
متن کاملحل مسئله زمان بندی ماشینهای موازی نامرتبط با اهداف کل زودکرد وزنی و کل دیرکرد وزنی با استفاده از الگوریتم جستجوی پراکنده چند هدفه
The parallel machine scheduling problem is an important and difficult problem to be considered in the real-world situations. Traditionally, this problem consists of the scheduling of a set of independent jobs on parallel machines with the aim of minimizing the maximum job completion. In today's manufacturing systems, in which both early and tardy finishing of job processing are undesired, the o...
متن کاملA Multi-Objective Particle Swarm Optimization Algorithm for a Possibilistic Open Shop Problem to Minimize Weighted Mean Tardiness and Weighted Mean Completion Times
We consider an open shop scheduling problem. At first, a bi-objective possibilistic mixed-integer programming formulation is developed. The inherent uncertainty in processing times and due dates as fuzzy parameters, machine-dependent setup times and removal times are the special features of this model. The considered bi-objectives are to minimize the weighted mean tardiness and weighted mean co...
متن کاملGoing beyond the Hero in Leadership Development: The Place of Healthcare Context, Complexity and Relationships; Comment on “Leadership and Leadership Development in Healthcare Settings – A Simplistic Solution to Complex Problems?”
There remains a conviction that the torrent of publications and the financial outlay on leadership development will create managers with the skills and characters of perfect leaders, capable of guiding healthcare organisations through the challenges and crises of the 21st century. The focus of much attention continues to be the search for the (illusory) core set of heroic qualities, abilities o...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کامل